Single and Multiple Pattern String Matching Algorithm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fast Multiple String-pattern Matching Algorithm

In this paper, we propose a simple but eecient multiple string pattern matching algorithm based on a compact encoding scheme. This algorithm scans text from left to right while encoding characters in the text based on the alphabet that occurs in the input patterns. The simple scanning algorithm demonstrates the ability to handle a very large number of input patterns simultaneously. Our experime...

متن کامل

Improved Single and Multiple Approximate String Matching

We present a new algorithm for multiple approximate string matching. It is based on reading backwards enough `-grams from text windows so as to prove that no occurrence can contain the part of the window read, and then shifting the window. Three variants of the algorithm are presented, which give different tradeoffs between how much they work in the window and how much they shift it. We show an...

متن کامل

Multiple Skip Multiple Pattern Matching Algorithm (MSMPMA)

A new algorithm to search for multiple patterns simultaneously is proposed. The multiple pattern algorithms can be used in many applications that require such type of search and matching. For example, a multipattern matching can be used in lieu of indexing or sorting data in some applications that involve small to medium size datasets. One of its advantages is that no additional search structur...

متن کامل

Pattern Recognition and String Matching

4 String Design 5 4.1 Maximum Distance Code . . . . . . . . . . . . . . . . . . . . . . . . . . 6 4.2 Equidistant code and Bayes rule . . . . . . . . . . . . . . . . . . . . . . 7 4.3 Equidistant code and unbiased distance . . . . . . . . . . . . . . . . . . 7 4.4 Summary of Constraints . . . . . . . . . . . . . . . . . . . . . . . . . . 9 4.5 Code Sensitivity . . . . . . . . . . . . . . . . . ...

متن کامل

Recursive Shift Indexing: A Fast Multi-Pattern String Matching Algorithm

String matching algorithms are essential for network devices that filter packets and flows based on their payload. Applications like intrusion detection/prevention, web filtering, anti-virus, and anti-spam all raise the demand for efficient algorithms dealing with string matching. This paper presents a novel multi-pattern string matching algorithm which reduces character comparisons based on re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Indian Journal of Science and Technology

سال: 2017

ISSN: 0974-5645,0974-6846

DOI: 10.17485/ijst/2017/v10i3/84939